planar point set

They are as follow, an optimal algorithm for determining the convex hull of a finite planar point set, an algorithm for triangulation of planar point-set in O ( nlogn) time, the fast algorithm for Delaunay triangulation of simple polygon based on maximum triangle weights.

它们分别是求平面点集凸壳的格雷厄姆方法的一个改进算法，一种时间复杂度为O（nlogn）的平面点集三角剖分算法和简单多边形快速Delaunay三角剖分算法。

optimum algorithm for constructing convex hull of planar point set utilizing plus or minus characteristic of demarcation

利用正负划分性求平面点集凸包的最优算法

constructing convex hull of planar point set is a basic algorithm in computational geometry.

求平面点集的凸包是计算几何的一个基本算法。

An On-line Algorithm for Finding Stable Line Segments of a Planar Point Set

求平面点集独立线段的一个联机算法

approximate algorithm for convex hull of planar point set

平面点集凸壳的一种近似算法

the purpose of step is to partition planar point set and to simplify the calculation distance from a point to a straight line.

然后进一步详细地给出了一种改进的求平面任意散乱点集凸包的新算法。

an algorithm for determining convex hull of a given planar point set

一种给定平面点集凸壳算法

an efficient algorithm for the convex hull of planar point set

平面点集凸壳的一种快速算法

design and implementation of an approximately linear average-case complexity algorithm for voronoi diagram of planar point set

近似线性平均复杂性的平面点集Voronoi图增量算法的设计与实现

parallel convex hull algorithm of planar point set based on pc cluster

平面点集凸包的并行算法研究

Wang Zi Qiang et al presented a new algorithm for computing the convex hull of a planar point set in 1998, and claimed that the worst case time complexity of the algorithm is O ( n), which can lead to a linear time algorithm for sorting.

王志强等于1998年提出了一个计算平面点集凸包的新算法，并且声称该算法的最坏时间复杂度为O（n），从而为线性时间排序提供了可能性。